Two algorithms for solving general backward pentadiagonal linear systems

نویسنده

  • A. A. Karawia
چکیده

Abstract In this paper we present an efficient computational and symbolic algorithms for solving a backward pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA, MATHEMATICA, and MATLAB are straightforward. An examples are given in order to illustrate the algorithms. The symbolic algorithm is competitive the other methods for solving a backward pentadiagonal linear systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Solving Pentadiagonal Linear Systems via Transformations

Many authors studied numeric algorithms for solving the linear systems of the pentadiagonal type. The well-known Fast Pentadiagonal System Solver algorithm is an example of such algorithms. The current article is describes new numeric and symbolic algorithms for solving pentadiagonal linear systems via transformations. New algorithms are natural generalization of the work presented in [Moawwad ...

متن کامل

A Method for Solving Hermitian Pentadiagonal Block Circulant Systems of Linear Equations

A new effective method and its two modifications for solving Hermitian pentadiagonal block circulant systems of linear equations are proposed. New algorithms based on the proposed method are constructed. Our algorithms are then compared with some classical techniques as far as implementation time is concerned, number of operations and storage. Numerical experiments corroborating the effectivene...

متن کامل

Rotated Alternative LU Decomposition Method and Its Preconditioner for Periodic Block Pentadiagonal Linear Systems on Vector Processor

In this paper, a new method "Rotated Alternative LU (Rotated ALU) decomposition" for solving block pentadiagonal linear systems is proposed, that makes vector processing more e cient. And a new way to apply the Rotated ALU decomposition to periodic pentadiagonal linear systems is proposed. A few numerical experiments show that these methods are more faster than the conventional LU decomposition.

متن کامل

A Method for Solving Special Circulant Pentadiagonal Linear Systems

A new effective modification of the method which is described in [1] for solving of real symmetric circulant pentadiagonal systems of linear equations is proposed. We consider the case where the coefficient matrix is not diagonal dominant. This paper shows efficiency and stability of the presented method.

متن کامل

A parallel method for solving pentadiagonal systems of linear equations

A new parallel approach for solving a pentadiagonal linear system is presented. The parallel partition method for this system and the TW parallel partition method on a chain of P processors are introduced and discussed. The result of this algorithm is a reduced pentadiagonal linear system of order P 2 compared with a system of order 2P 2 for the parallel partition method. More importantly the n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 87  شماره 

صفحات  -

تاریخ انتشار 2010